On the solution of the fuzzy Sylvester matrix equation
نویسنده
چکیده
In this paper, we consider the fuzzy Sylvester matrix equation AX + XB = C, where A ∈ Rn×n and B ∈ Rm×m are crisp M-matrices, C is an n×m fuzzy matrix and X is unknown. We first transform this system to an (mn)× (mn) fuzzy system of linear equations. Then we investigate the existence and uniqueness of a fuzzy solution to this system. We use the accelerated overrelaxation method to compute an approximate solution to this system. Some numerical experiments are given to illustrate the theoretical results. AMS Subject Classification : 15A06, 90C70.
منابع مشابه
ABS METHOD FOR SOLVING FUZZY SYLVESTER MATRIX EQUATION
The main aim of this paper intends to discuss the solution of fuzzy Sylvester matrix equation
متن کاملOn the solving of matrix equation of Sylvester type
A solution of two problems related to the matrix equation of Sylvester type is given. In the first problem, the procedures for linear matrix inequalities are used to construct the solution of this equation. In the second problem, when a matrix is given which is not a solution of this equation, it is required to find such solution of the original equation, which most accurately approximates the ...
متن کاملOn the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملGlobal conjugate gradient method for solving large general Sylvester matrix equation
In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$ is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...
متن کاملGauss-Sidel and Successive Over Relaxation Iterative Methods for Solving System of Fuzzy Sylvester Equations
In this paper, we present Gauss-Sidel and successive over relaxation (SOR) iterative methods for finding the approximate solution system of fuzzy Sylvester equations (SFSE), AX + XB = C, where A and B are two m*m crisp matrices, C is an m*m fuzzy matrix and X is an m*m unknown matrix. Finally, the proposed iterative methods are illustrated by solving one example.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Soft Comput.
دوره 15 شماره
صفحات -
تاریخ انتشار 2011